Pruning AdaBoost for Continuous Sensors Mining Applications
نویسندگان
چکیده
In this work, pruning techniques for the AdaBoost classifier are evaluated specially aimed for a continuous learning framework in sensors mining applications. To assess the methods, three pruning schemes are evaluated using standard machine-learning benchmark datasets, simulated drifting datasets and real cases. Early results obtained show that pruning methodologies approach and sometimes out-perform the no-pruned version of the classifier, being at the same time more easily adaptable to the drift in the training distribution. Future works are planned in order to evaluate the approach in terms of time efficiency and extension to big-data analysis.
منابع مشابه
On the Boosting Pruning Problem (short Submission)
Boosting is a powerful method for improving the predictive accuracy of classiiers. The AdaBoost algorithm of Freund and Schapire has been successfully applied to many domains 2, 10, 12] and the combination of AdaBoost with the C4.5 decision tree algorithm has been called the best oo-the-shelf learning algorithm in practice. Unfortunately, in some applications, the number of decision trees requi...
متن کاملOn the Boosting Pruning Problem
Boosting is a powerful method for improving the predic-tive accuracy of classiiers. The AdaBoost algorithm of Freund and Schapire has been successfully applied to many domains 2, 10, 12] and the combination of AdaBoost with the C4.5 decision tree algorithm has been called the best oo-the-shelf learning algorithm in practice. Unfortunately , in some applications, the number of decision trees req...
متن کاملA Survey on One Class Classification using Ensembles Method
In Data mining Classification is a data mining function that allocated similar data to categories or classes. One of the most common methods for classification is ensemble method which refers supervised learning. After generating classification rules we can apply those rules on unknown data and reach to the results. In one-class classification it is assumed that only information of one of the c...
متن کاملPruning Adaptive Boosting *** Icml-97 Final Draft ***
The boosting algorithm AdaBoost de veloped by Freund and Schapire has ex hibited outstanding performance on sev eral benchmark problems when using C as the weak algorithm to be boosted Like other ensemble learning approaches AdaBoost constructs a composite hy pothesis by voting many individual hy potheses In practice the large amount of memory required to store these hypotheses can make ensembl...
متن کاملA New Algorithm for High Average-utility Itemset Mining
High utility itemset mining (HUIM) is a new emerging field in data mining which has gained growing interest due to its various applications. The goal of this problem is to discover all itemsets whose utility exceeds minimum threshold. The basic HUIM problem does not consider length of itemsets in its utility measurement and utility values tend to become higher for itemsets containing more items...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013